Research on Job-shop Scheduling Problem Based on Improved Particle Swarm Optimization
نویسنده
چکیده
Considering the standard particle swarm optimization (PSO) has the shortcomings of low convergence precision in job shop scheduling problems, the job shop scheduling solution is presented based on improved particle swarm optimization (A-PSO). In this paper, the basic theory of A-PSO is described. Also, the coding and the selection of parameters as well as the decoding of A-PSO are studied. It uses the maximum flow time which is minimized to evaluate the performance of the algorithm, and applies it to solve a typical scheduling problem. A large number of simulation results show that this algorithm has good feasibility and effectiveness in job-shop scheduling problem.
منابع مشابه
A Particle Swarm Optimization Approach to Joint Location and Scheduling Decisions in A Flexible Job Shop Environment
In traditional scheduling literature, it is generally assumed that the location of facilities are predetermined and fixed in advance. However, these decisions are interrelated and may impact each other significantly. Therefore finding a schedule and facility location has become an important problem as an extension of the well-known scheduling problems. In this research we consider joint decisio...
متن کاملTrain Scheduling Problem with Consideration of Praying Constraint as an Application of Job Shop Scheduling Problem
The present paper extends the idea of job shop scheduling problem with resting constraints to the train scheduling problem with the Muslim praying considerations. For this purpose, after proposing the new mathematical model, a heuristic algorithm based on the Electromagnetism-Like algorithm (EM) which is well adjusted to scheduling problems is employed to solve the large-size practical cases. T...
متن کاملThree Hybrid Metaheuristic Algorithms for Stochastic Flexible Flow Shop Scheduling Problem with Preventive Maintenance and Budget Constraint
Stochastic flexible flow shop scheduling problem (SFFSSP) is one the main focus of researchers due to the complexity arises from inherent uncertainties and also the difficulty of solving such NP-hard problems. Conventionally, in such problems each machine’s job process time may encounter uncertainty due to their relevant random behaviour. In order to examine such problems more realistically, fi...
متن کاملSolving Flexible Job-Shop Scheduling Problem using Hybrid Algorithm Based on Gravitational Search Algorithm and Particle Swarm Optimization
Job Shop scheduling problem has significant importance in many researching fields such as production management and programming and also combined optimizing. Job Shop scheduling problem includes two sub-problems: machine assignment and sequence operation performing. In this paper combination of particle swarm optimization algorithm (PSO) and gravitational search algorithm (GSA) have been presen...
متن کاملOn the Influence of Parameters in Particle Swarm Optimisation Algorithm for Job Shop Scheduling
Particle Swarm Optimization (PSO) is one of the latest nature inspired meta-heuristic algorithms based on the metaphor of social interaction and communication such as bird flocking and fish schooling. PSO is a population based algorithm for finding optimal regions of complex search spaces through interaction of individuals in the population. In PSO, a set of randomly generated solutions (initia...
متن کامل